Covering the vertex set of a graph with subgraphs of smaller degree
نویسندگان
چکیده
منابع مشابه
Smaller Subgraphs of Minimum Degree $k$
In 1990, Erdős, Faudree, Rousseau and Schelp proved that for k > 2 every graph with n > k+ 1 vertices and (k− 1)(n−k+ 2) + ( k−2 2 ) + 1 edges contains a subgraph of minimum degree k on at most n − √ n/6k3 vertices. They conjectured that it is possible to remove at least kn many vertices and remain with a subgraph of minimum degree k, for some k > 0. We make progress towards their conjecture by...
متن کاملVertex-disjoint subgraphs with high degree sums
For a graph G, we denote by σ2(G) the minimum degree sum of two non-adjacent vertices if G is non-complete; otherwise, σ2(G) = +∞. In this paper, we give the following two results; (i) If s1 and s2 are integers with s1, s2 ≥ 2 and if G is a non-complete graph with σ2(G) ≥ 2(s1 + s2 + 1) − 1, then G contains two vertexdisjoint subgraphs H1 and H2 such that each Hi is a graph of order at least si...
متن کاملan investigation of the types of text reduction in subtitling: a case study of the persian film gilaneh with english subtitles
چکیده ندارد.
15 صفحه اولPartitioning the vertex set of a bipartite graph into complete bipartite subgraphs
Given a graph and a positive integer k, the biclique vertex-partition problem asks whether the vertex set of the graph can be partitioned into at most k bicliques (connected complete bipartite subgraphs). It is known that this problem is NP-complete for bipartite graphs. In this paper we investigate the computational complexity of this problem in special subclasses of bipartite graphs. We prove...
متن کاملCovering the edges of a graph by three odd subgraphs
We prove that any finite simple graph can be covered by three of its odd subgraphs, and we construct an infinite sequence of graphs where an edge-disjoint covering by three odd subgraphs is not possible. c © ??? John Wiley & Sons, Inc.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1978
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90147-4